Partial identification in the statistical matching problem
نویسندگان
چکیده
منابع مشابه
Partial identification in the statistical matching problem
The statistical matching problem involves the integration of multiple datasets where some variables are not observed jointly. This missing data pattern leaves most statistical models unidentifiable. Statistical inference is still possible when operating under the framework of partially identified models, where the goal is to bound the parameters rather than to estimate them precisely. In many m...
متن کاملThe matching interdiction problem in dendrimers
The purpose of the matching interdiction problem in a weighted graph is to find two vertices such that the weight of the maximum matching in the graph without these vertices is minimized. An approximate solution for this problem has been presented. In this paper, we consider dendrimers as graphs such that the weights of edges are the bond lengths. We obtain the maximum matching in some types of...
متن کاملPartial Identification in Two-sided Matching Models
In this paper we propose a methodology for estimating preference parameters in matching models. Our estimator applies to repeated observations of matchings among a fixed group of individuals, which is a similar data structure as in Fox (2010). Our estimator is based on stability conditions in the matching models; we consider both transferable (TU) and non-transferable utility (NTU) models. In b...
متن کاملStatistical Matching in ‘Labour Force’ and ‘Time Use’ Surveys
Abstract. In the National Statistical Systems, some parts of the official statistics required for development planning and evidence base management are collected through sampling survey. Due to the high cost of sampling process, as well as nonresponses, it may not be possible to collect all of the expected variables in a survey.In order to obtain a comprehensive and complete source o...
متن کاملmatching interdiction problem in dendrimers
the purpose of the matching interdiction problem in a weighted graph is to findtwo vertices such that the weight of the maximum matching in the graph withoutthese vertices is minimized. an approximate solution for this problem has beenpresented. in this paper, we consider dendrimers as graphs such that the weightsof edges are the bond lengths. we obtain the maximum matching in some types ofdend...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Statistics & Data Analysis
سال: 2016
ISSN: 0167-9473
DOI: 10.1016/j.csda.2016.06.005